Robust Minimal Recursion Semantics

نویسنده

  • Ann Copestake
چکیده

Deep and shallow processing techniques have complementary strengths and weaknesses. There are various ways in which deep and shallow techniques can be combined in practical systems to take advantage of the strengths of each approach. In this paper, I argue for the advantages of using a semantic representation as the interface between various types of deep and shallow processing. I illustrate how with a flat semantics approach, shallow processing can be regarded as producing a semantics which is underspecified with respect to deeper processing, but fully compatible with it. I describe the notion of specificity which results and illustrate its connection with specificity in typed feature structures. I also show how semantic composition rules designed for deep formalisms can be adapted to shallow processing. Some practical experiments are described using the tag sequence grammar from the RASP tools and the LinGO English Resource Grammar.1

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Semantic Composition with (Robust) Minimal Recursion Semantics

We discuss semantic composition in Minimal Recursion Semantics (MRS) and Robust Minimal Recursion Semantics (RMRS). We demonstrate that a previously defined formal algebra applies to grammar engineering across a much greater range of frameworks than was originally envisaged. We show how this algebra can be adapted to composition in grammar frameworks where a lexicon is not assumed, and how this...

متن کامل

Hierarchical Statistical Semantic Realization for Minimal Recursion Semantics

We introduce a robust statistical approach to realization from Minimal Recursion Semantics representations. The approach treats realization as a translation problem, transforming the Dependency MRS graph representation to a surface string. Translation is based on a Synchronous Context-Free Grammar that is automatically extracted from a large corpus of parsed sentences. We have evaluated the new...

متن کامل

Sentence Comparison Using Robust Minimal Recursion Semantics And An Ontology

We design and test a sentence comparison method using the framework of Robust Minimal Recursion Semantics which allows us to utilise the deep parse information produced by Jacy, a Japanese HPSG based parser and the lexical information available in our on-tology. Our method was used for both paraphrase detection and also for answer sentence selection for question answering. In both tasks, result...

متن کامل

A Logic of Semantic Representations for Shallow Parsing

One way to construct semantic representations in a robust manner is to enhance shallow language processors with semantic components. Here, we provide a model theory for a semantic formalism that is designed for this, namely Robust Minimal Recursion Semantics (RMRS). We show that RMRS supports a notion of entailment that allows it to form the basis for comparing the semantic output of different ...

متن کامل

Constraint-based RMRS Construction from Shallow Grammars

We present a constraint-based syntax-semantics interface for the construction of RMRS (Robust Minimal Recursion Semantics) representations from shallow grammars. The architecture is designed to allow modular interfaces to existing shallow grammars of various depth – ranging from chunk grammars to context-free stochastic grammars. We define modular semantics construction principles in a typed fe...

متن کامل

Applying Robust Semantics

Semantic representations provide an abstraction which allows generalisations to be made across very different surface forms and different syntactic formalisms. But deriving conventional semantic representations requires more information than can be extracted from morphology and syntax, even by deep grammars. The standard way of dealing with this is to use underspecified semantic representations...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004